Algebraic Geometric codes from Kummer Extensions
نویسندگان
چکیده
In the early eighties tools from algebraic geometry were applied by V. Goppa to construct linear codes using algebraic curves over finite fields, see [7]. Nowadays these codes are called algebraic-geometric codes, AG codes for short. The starting point in the construction of an AG code is a projective, absolutely irreducible, non singular algebraic curve X of genus g ≥ 1 defined over the finite field Fq with cardinality q. Let F = Fq(X ) be its function field with Fq being the field of constants. Consider Q1, . . . , Qn pairwise distinct rational places
منابع مشابه
Multi-point codes over Kummer extensions
This paper is concerned with the construction of algebraic geometric codes defined from Kummer extensions. It plays a significant role in the study of such codes to describe bases for the Riemann-Roch spaces associated with totally ramified places. Along this line, we give an explicit characterization of Weierstrass semigroups and pure gaps. Additionally, we determine the floor of a certain typ...
متن کاملWeierstrass semigroups from Kummer extensions
The Weierstrass semigroups and pure gaps can be helpful in constructing codes with better parameters. In this paper, we investigate explicitly the minimal generating set of the Weierstrass semigroups associated with several totally ramified places over arbitrary Kummer extensions. Applying the techniques provided by Matthews in her previous work, we extend the results of specific Kummer extensi...
متن کاملA Note on an Asymptotically Good Tame Tower
The explicit construction of function fields tower with many rational points relative to the genus in the tower play a key role for the construction of asymptotically good algebraic-geometric codes. In 1997 Garcia, Stichtenoth and Thomas [6] exhibited two recursive asymptotically good Kummer towers over any non-prime field. Wulftange determined the limit of one tower in his PhD thesis [13]. In ...
متن کاملAutomorphisms of F.K. Schmidt codes and a new method to derive cyclic sub-codes from algebraic geometric codes
We present a new method to obtain cyclic subcodes of algebraic geometric codes using their automorphisms. Automorphisms of algebraic geometric codes from F. K. Schmidt curves are proposed. We present an application of this method in designing frequency hopping sequences for spread spectrum systems. Algebraic geometric codes can provide sequences longer (better randomness) than the ones from Ree...
متن کاملLower bounds on the minimum distance of long codes in the Lee metric
The Gilbert type bound for codes in the title is reviewed, both for small and large alphabets. Constructive lower bounds better than these existential bounds are derived from geometric codes, either over Fp or Fp2 , or over even degree extensions of Fp. In the latter case the approach is concatenation with a good code for the Hamming metric as outer code and a short code for the Lee metric as a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1606.04143 شماره
صفحات -
تاریخ انتشار 2016